Maintenance Planning in Re-entrant Flow Shop (1st Report)
نویسندگان
چکیده
منابع مشابه
Solving Re-entrant No-wait Flow Shop Scheduling Problem
In this study, we consider the production environment of no-wait reentrant flow shop with the objective of minimizing makespan of the jobs. In a reentrant flow shop, at least one job should visit at least one of the machines more than once. In a no-wait flowshop scheduling problem, when the process of a specific job begins on the first machine, it should constantly be processed without waiting ...
متن کاملUsing simplified drum-buffer-rope for re-entrant flow shop scheduling in a random environment
The traditional simplified drum buffer rope (SDBR) does not consider the application of re-entrant flow shop (RFS) in a random environment which might involve variable processing times and machine breakdowns. This paper proposed a weighted layer production buffer and weighted production buffer to monitor the status of the buffer deviation when applying SDBR in a RFS with non-deterministic param...
متن کاملMulti-level genetic algorithm for the resource-constrained re-entrant scheduling problem in the flow shop
The re-entrant flow shop scheduling problem (RFSP) is regarded as a NP-hard problem and attracted the attention of both researchers and industry. Current approach attempts to minimize the makespan of RFSP without considering the interdependency between the resource constraints and the re-entrant probability. This paper proposed Multi-level genetic algorithm (GA) by including the co-related reen...
متن کاملDesign of a genetic algorithm for bi-objective flow shop scheduling problems with re-entrant jobs
This paper presents a simulated genetic algorithm (GA) model of scheduling the flow shop problem with reentrant jobs. The objective of this research is to minimize the weighted tardiness and makespan. The proposed model considers that the jobs with non-identical due dates are processed on the machines in the same order. Furthermore, the re-entrant jobs are stochastic as only some jobs are requi...
متن کاملHybrid tabu search for re-entrant permutation flow-shop scheduling problem
The assumption of classical shop scheduling problems that each job visits each machine only once (Baker, 1974) is often violated in practice. A new type of manufacturing shop, the reentrant shop has recently attracted attention. The basic characteristic of a re-entrant shop is that a job visits certain machines more than once. For example, in semiconductor manufacturing, consequently, each wafe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Japan Society for Precision Engineering
سال: 2010
ISSN: 1882-675X,0912-0289
DOI: 10.2493/jjspe.76.468